Pruning Redundant Association Rules Using Maximum Entropy Principle
نویسندگان
چکیده
منابع مشابه
Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data
Sensors are widely used in all aspects of our daily life including factories, hospitals and even our homes. Discovering time series association rules from sensor data can reveal the potential relationship between different sensors which can be used in many applications. However, the time series association rule mining algorithms usually produce rules much more than expected. It‟s hardly to unde...
متن کاملInterestingness and Pruning of Mined Patterns
We study the following question: when can a mined pattern, which may be an association, a correlation, ratio rule, or any other, be regarded as interesting? Previous approaches to answering this question have been largely numeric. Speciically, we show that the presence of some rules may make others redundant, and therefore uninteresting. We articulate these principles and formalize them in the ...
متن کاملA novel method for constrained class association rule mining
To create a classifier using an associative classification algorithm, a complete set of class association rules (CARs) is obtained from the training dataset. Most generated rules, however , are either redundant or insignificant. They not only confuse end users during decision-making but also decrease the performance of the classification process. Thus, it is necessary to eliminate redundant or ...
متن کاملEntropy Based Pruning for Non-Negative Matrix Based Language Models with Contextual Features
Non-negative matrix based language models have been recently introduced [1] as a computationally efficient alternative to other feature-based models such as maximum-entropy models. We present a new entropy based pruning algorithm for this class of language models, which is fast and scalable. We present perplexity and word error rate results and compare these against regular n-gram pruning. We a...
متن کاملA lattice-based approach for mining most generalization association rules
Traditional association rules consist of some redundant information. Some variants based on support and confidence measures such as non-redundant rules and minimal non-redundant rules were thus proposed to reduce the redundant information. In the past, we proposed most generalization association rules (MGARs), which were more compact than (minimal) non-redundant rules in that they considered th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002